#include <cstdlib> 
#include <cctype> 
#include <cstring> 
#include <cstdio> 
#include <cmath> 
#include <algorithm> 
#include <vector> 
#include <string> 
#include <iostream> 
#include <sstream> 
#include <map> 
#include <set> 
#include <queue> 
#include <stack> 
#include <fstream> 
#include <iomanip> 
#include <bitset> 
#include <list> 
using namespace std; 
#define REP(i,n) for(i=0;i<(n);++i) 
#define FOR(i,l,h) for(i=(l);i<=(h);++i) 
#define FORD(i,h,l) for(i=(h);i>=(l);--i) 
typedef vector<int> VI; 
typedef vector<double> VD; 
//typedef long long LL; 

class CandyShop 
{ 
        public: 
        int countProbablePlaces(vector <int> X, vector <int> Y, vector <int> R) 
        { 
            int res = 0;
      int curdis;
      int i, j, k;
      for( i = -200; i <= 200; i ++)
      {
        for( j = -200; j <= 200; j ++)
        {
          for( k = 0; k < X.size(); k ++)
          {
            curdis = abs(i - X[k]) + abs(j - Y[k]);
            if(curdis > R[k] )
              break;
          }
          if(k == X.size())
          {
            res ++;
          }
        }
      }
      return res;
        } 
        
 
}; 


// Powered by FileEdit
// Powered by TZTester 1.01 [25-Feb-2003]
// Powered by CodeProcessor
